Maintaining LU factors of a general sparse matrix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive approach in sparse matrix LU factorization

This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for...

متن کامل

Block LU factors of generalized companion matrix pencils

We present formulas for computations involving companion matrix pencils as may arise in considering polynomial eigenvalue problems. In particular, we provide explicit companion matrix pencils for matrix polynomials expressed in a variety of polynomial bases including monomial, orthogonal, Newton, Lagrange, and Bernstein/Bézier bases. Additionally, we give a pair of explicit LU factors associate...

متن کامل

Quantitative Methods Inquires 179 IMPROVING THE PERFORMANCE OF SPARSE LU MATRIX FACTORIZATION USING A SUPERNODAL ALGORITHM

In this paper we investigate a method to improve the performance of sparse LU matrix factorization used to solve unsymmetric linear systems, which appear in many mathematical models. We introduced and used the concept of the supernode for unsymmetric matrices in order to use dense matrix operations to perform the LU factorization for sparse matrices. We describe an algorithm that uses supernode...

متن کامل

Sparse LU Decomposition using FPGA

This paper reports on an FPGA implementation of sparse LU decomposition. The resulting special purpose hardware is geared towards power system problems load flow computation which are typically solved iteratively using Newton Raphson. The key step in this process, which takes approximately 85% of the computation time, is the solution of sparse linear systems arising from the Jacobian matrices t...

متن کامل

Multiple LU factorizations of a singular matrix

A singular matrix A may have more than one LU factorizations. In this work the set of all LU factorizations of A is explicitly described when the lower triangular matrix L is nonsingular. To this purpose, a canonical form of A under left multiplication by unit lower triangular matrices is introduced. This canonical form allows us to characterize the matrices that have an LU factorization and to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1987

ISSN: 0024-3795

DOI: 10.1016/0024-3795(87)90112-1